Towards Nominal Formal Languages (long version)
نویسندگان
چکیده
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
منابع مشابه
Towards Nominal Formal Languages
We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.
متن کاملA Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. Pitts stated some general conditions under which functions over alpha-equivalence classes can be defined by a form of structural recursion and gave a clever proof for the existence of a primitive-recursion combinator. ...
متن کاملTwo-level Lambda-calculus
Two-level lambda-calculus is designed to provide a mathematical model of capturing substitution, also called instantiation. Instantiation is a feature of the ‘informal meta-level’; it appears pervasively in specifications of the syntax and semantics of formal languages. The two-level lambda-calculus has two levels of variable. Lambda-abstraction and beta-reduction exist for both levels. A level...
متن کاملSimple nominal type theory
Nominal logic is an extension of first-order logic with features useful for reasoning about abstract syntax with bound names. For computational applications such as programming and formal reasoning, it is desirable to develop constructive type theories for nominal logic which extend standard type theories for propositional, firstor higher-order logic. This has proven difficult, largely because ...
متن کاملAlgebraic Meta-Theories and Synthesis of Equational Logics
Fiore and Hur [18] recently introduced a novel methodology—henceforth referred to as Sol—for the Synthesis of equational and rewriting logics from mathematical models. In [18], Sol was successfully applied to rationally reconstruct the traditional equational logic for universal algebra of Birkhoff [3] and its multi-sorted version [26], and also to synthesise a new version of the Nominal Algebra...
متن کامل